Auflistung nach Schlagwort "Post's lattice"

Sortiert nach: Sortierung: Ergebnisse:

  • The complexity of generalized satisfiability for linear temporal logic 
    Bauland, Michael; Schneider, Thomas; Schnoor, Henning; Schnoor, Ilka; Vollmer, Heribert (Braunschweig : International Federation for Computational Logic, 2009)
    In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set ...
  • Connectivity of Boolean satisfiability 
    Schwerdtfeger, Konrad W. (Hannover : Gottfried Wilhelm Leibniz Universität Hannover, 2016)
    [no abstract]
  • Parametrised complexity of satisfiability in temporal logic 
    Lück, Martin; Meier, Arne; Schindler, Irena (Association for Computing Machinery, 2017)
    We apply the concept of formula treewidth and pathwidth to computation tree logic, linear temporal logic, and the full branching time logic. Several representations of formulas as graphlike structures are discussed, and ...